Network complexity - PDFSEARCH.IO - Document Search Engine

Network complexity
Results: 339

#	Item
111	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
112	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
113	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-08 10:04:52 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
114	How I Entered Constraints (and Met Ugo at the Doorway): Some of the Early Milestones Rina Dechter UC-Irvine Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2008-09-08 14:27:27 Software engineering Local consistency Flow network A* search algorithm Heuristic Constraint Decomposition method Complexity of constraint satisfaction Constraint programming Artificial intelligence Graph theory
115	On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-03-07 16:59:32 Complexity classes Mathematical optimization Structural complexity theory Conjectures Permutation NP Directed acyclic graph Optimization problem Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
116	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On the Complexity of Point Recolouring in Geometric Graphs Henk Meijer Roosevelt Academy Middelburg, The Netherlands Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:47 Planar graphs Graph Minor Edge coloring Apollonian network Graph theory Mathematics Graph coloring
117	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
118	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-03 08:24:08 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
119	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
120	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory

UPDATE